import java.util.*;
import java.io.*;
class Main2 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();
        int ab = gdc(a,b);
        System.out.println(a*b/ab);
    }

    public static int gdc(int a, int b){
        if (a == b){
            return a;
        }
        if (a < b){
            int tmp = a;
            a = b;
            b = tmp;
        }

        int r = 0;
        while ( (r = a % b) > 0){
            a = b;
            b = r;
        }
        return b;
    }
}
class Main1 {
    public static void main(String[] args) throws IOException {
        BufferedReader bi = new BufferedReader(new InputStreamReader(System.in));
        int n  = Integer.parseInt(bi.readLine());
        String[] str = new String[n];
        for (int i = 0; i < n; i++){
            str[i] = bi.readLine();
        }
        if (isSortLength(str) && isSortZidian(str)){
            System.out.println("both");
        }else if (isSortLength(str)){
            System.out.println("lengths");
        }else if (isSortZidian(str)){
            System.out.println("lexicographically");
        }else{
            System.out.println("none");
        }


    }
    public static boolean isSortZidian(String[] str){
        for (int i = 0; i < str.length-1; i++){
            if (str[i].compareTo(str[i+1]) > 0){
                return false;
            }
        }
        return true;


    }

    public static boolean isSortLength(String[] str){
        for (int i = 0; i < str.length-1; i++){
            if (str[i].length() > str[i+1].length()){
                return false;
            }
        }
        return true;
    }
}
class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int f1 = 0;
        int f2 = 1;
        while(f2 < a){
            int f3 = f1 + f2;
            f1 = f2;
            f2 = f3;

        }
        int min = Math.min(f2-a,a-f1);
        System.out.println(min);

    }
}
class Parenthesis {
    public boolean chkParenthesis(String A, int n) {
        if (n % 2 != 0){
            return false;
        }
        Stack<Character> stack = new Stack<>();
        for (char ch : A.toCharArray()){
            if (ch == '('){
                stack.push(ch);

            }else if (ch == ')'){
                if (stack.isEmpty()){
                    return false;
                }else if (stack.peek() == '('){
                    stack.pop();
                }
            }else{
                return false;
            }
        }
        return stack.isEmpty();
    }
}
public class Test {
}
